Search results for "Distributed algorithm"
showing 10 items of 39 documents
Energy Efficient Optimization for Computation Offloading in Fog Computing System
2017
In this paper, we investigate the energy efficient computation offloading scheme in a multi-user fog computing system. We consider the users need to make the decision on whether to offload the tasks to the fog node nearby, based on the energy consumption and delay constraint. In particular, we utilize queuing theory to bring a thorough study on the energy consumption and execution delay of the offloading process. Two queuing models are applied respectively to model the execution processes at the mobile device (MD) and fog node. Based on the theoretical analysis, an energy efficient optimization problem is formulated with the objective to minimize the energy consumption subjects to execution…
Reducing the observation error in a WSN through a consensus-based subspace projection
2013
An essential process in a Wireless Sensor Network is the noise mitigation of the measured data, by exploiting their spatial correlation. A widely used technique to achieve this reduction is to project the measured data into a proper subspace. We present a low complexity and distributed algorithm to perform this projection. Unlike other algorithms existing in the literature, which require the number of connections at every node to be larger than the dimension of the involved subspace, our algorithm does not require such dense network topologies for its applicability, making it suitable for a larger number of scenarios. Our proposed algorithm is based on the execution of several consensus pro…
Informational and linguistic analysis of large genomic sequence collections via efficient Hadoop cluster algorithms
2018
Abstract Motivation Information theoretic and compositional/linguistic analysis of genomes have a central role in bioinformatics, even more so since the associated methodologies are becoming very valuable also for epigenomic and meta-genomic studies. The kernel of those methods is based on the collection of k-mer statistics, i.e. how many times each k-mer in {A,C,G,T}k occurs in a DNA sequence. Although this problem is computationally very simple and efficiently solvable on a conventional computer, the sheer amount of data available now in applications demands to resort to parallel and distributed computing. Indeed, those type of algorithms have been developed to collect k-mer statistics in…
Efficient distributed average consensus in wireless sensor networks
2020
International audience; Computing the distributed average consensus in Wireless Sensor Networks (WSNs) is investigated in this article. This problem, which is both natural and important, plays a significant role in various application fields such as mobile agents and fleet vehicle coordination, network synchronization, distributed voting and decision, load balancing of divisible loads in distributed computing network systems, and so on. By and large, the average consensus' objective is to have all nodes in the network converged to the average value of the initial nodes' measurements based only on local nodes' information states. In this paper, we introduce a fully distributed algorithm to a…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes
2005
The static frequency assignment problem on cellular networks can be abstracted as a multicoloring problem on a weighted graph, where each vertex of the graph is a base station in the network, and the weight associated with each vertex represents the number of calls to be served at the vertex. The edges of the graph model interference constraints for frequencies assigned to neighboring stations. In this paper, we first propose an algorithm to multicolor any weighted planar graph with at most $\frac{11}{4}W$ colors, where W denotes the weighted clique number. Next, we present a polynomial time approximation algorithm which garantees at most 2W colors for multicoloring a power square mesh. Fur…
A recognize-and-accuse policy to speed up distributed processes
1994
Topic 5: Parallel and Distributed Data Management
2013
Nowadays we are facing an exponential growth of new data that is overwhelming the capabilities of companies, institutions and the society in general to manage and use it in a proper way. Ever-increasing investments in Big Data, cutting edge technologies and the latest advances in both application development and underlying storage systems can help dealing with data of such magnitude. Especially parallel and distributed approaches will enable new data management solutions that operate effectively at large scale.